A note on searching sorted unbalanced three-dimensional arrays
نویسندگان
چکیده
We examine the problem of searching sequentially for a desired real value (a key) within a sorted unbalanced three-dimensional finite real array. This classic problem can be viewed as determining the correct dimensional threshold function from a finite class of such functions within the array, based on sequential queries that take the form of point samples. This note addresses the challenge of constructing algorithms that require the minimum number of queries necessary in the worst case, to search for a given key in arrays that have three dimensions with sizes that are not necessarily equal.
منابع مشابه
Operation of Stand Alone PV Generating System for Supplying Unbalanced AC Loads
This paper describes a DC isolated network which is fed with Distributed Generation (DG) from photovoltaic (PV) renewable sources for supplying unbalanced AC loads. The battery energy storage bank has been connected to the DC network via DC/DC converter to control the voltage of the network and optimize the operation of the PV generation units. The PV arrays are connected to the DC network ...
متن کاملSearching monotone multi-dimensional arrays
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks’ search algorithm [2] for monotone 3-dimensional arrays to d-dimensions with d ≥ 4. Our new search algorithm is asymptotically optimal for d = 4.
متن کاملQuantum search of partially ordered sets
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can achieve at most a quadratic improvement in query complexity over classical algorithms, up to logarithmic factors; we also give quantum algorithms that almost achi...
متن کاملSearching On Multi-Dimensional Arrays with Partial Order
In this paper we investigate the problem of searching on d-dimensional arrays with partial order. We generalize Linial and Saks’ search algorithm [2] for 3 dimension to arbitrary dimension d. Our new algorithms require at most d d−1 n + O(n) comparisons. It is optimal for d = 4.
متن کاملA Fast Natural Algorithm for Searching: Preliminary version
In this note we present two natural algorithms—one for sorting and another for searching a sorted list of items. Both algorithms work in O( √ N) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.02371 شماره
صفحات -
تاریخ انتشار 2017